A mixed-integer programming approach for solving university course timetabling problems

Abstract This article presents a mixed-integer programming model for solving the university timetabling problem which considers allocation of students to classes and assignment rooms time periods each class. The was developed as part our participation in International Timetabling Competition 2019 produced ranking second place at competition. Modeling program is not new. Our contribution rests on number innovative features adapted this allow reduction variables constraints manageable levels achieving reasonable computational performance. proposed algorithm consists first-stage method obtain an initial feasible solution second-stage local search procedure iteratively improve value, both involve optimization problems.